Privacy Amplification Theorem for Noisy Main Channel
نویسندگان
چکیده
Secret key agreement protocol between legal parties based on reconciliation and privacy amplification procedure has been considered in [2]. The so called privacy amplification theorem is used to estimate the amount of Shannon’s information leaking to an illegal party (passive eavesdropper) about the final key. We consider a particular case where one of the legal parties (Alice) sends to another legal party (Bob) a random binary string x through a binary symmetric channel (BSC) with bit error probability "m while an eavesdropper (Eve) receives this string through an independent BSC with bit error probability "w . We assume that "m < "w and hence the main channel is superior to the wire-tap channel. To reconcile the strings between legal parties Alice sends to Bob through noiseless channel the check string y based on some good error correcting code. Since this transmission is completely public Eve can eavesdrop it and therefore this extra information has to be taken into account in an estimation of the information leaking to Eve about the final key. In [3] an inequality has been proved to upper bound the information of Eve in such scenario. The main contribution of the running paper is to improve this inequality and hence to enhance the privacy amplification theorem. We present also bounds for the probability of false reconciliation when the check symbols of the linear code are transmitted through noiseless channel. The presented results can be very useful when considering the non-asymptotic case.
منابع مشابه
Quantum Privacy Amplification and the Security of Quantum Cryptography over Noisy Channels.
Existing quantum cryptographic schemes are not, as they stand, operable in the presence of noise on the quantum communication channel. Although they become operable if they are supplemented by classical privacy-amplification techniques, the resulting schemes are difficult to analyse and have not been proved secure. We introduce the concept of quantum privacy amplification and a cryptographic sc...
متن کاملQuantum Privacy Ampliication and the Security of Quantum Cryptography over Noisy Channels
Existing quantum cryptographic schemes are not, as they stand, operable in the presence of noise on the quantum communication channel. Although they become operable if they are supplemented by classical privacy-ampliication techniques, the resulting schemes are diicult to analyse and have not been proved secure. We introduce the concept of quantum privacy ampliication and a cryptographic scheme...
متن کاملPrivacy Amplification Against Active Quantum Adversaries
Privacy amplification is the task by which two cooperating parties transform a shared weak secret, about which an eavesdropper may have side information, into a uniformly random string uncorrelated from the eavesdropper. Privacy amplification against passive adversaries, where it is assumed that the communication is over a public but authenticated channel, can be achieved in the presence of cla...
متن کاملThe channel coding theorem and the security of binary randomization
We propose that the randomization protocol for privacy protection be viewed as a communication channel, with lower channel capacity implying greater privacy. Focusing on binary symmetric randomization, and attacks consisting of the querying of deterministically related attributes, we show that a one-to-one correspondence exists between (i) the patterns of all attacks of “rate” r nd (ii) inverti...
متن کاملTwo-map distillation protocols guarantee to reobtain a desired maximally entangled pure state
An idea of hybrid maps is proposed to establish purification protocols in which the demerits of the IBM and Oxford protocols are overcome. Examples of two-map protocol have been shown that they can be performed in distilling a desired maximally entangled pure state with certainty with equal efficiency as if the Oxford protocol is implemented. PACS: 03.67.-a Quantum information processings such ...
متن کامل